VARIETY OF MONOID RECOGNIZABLE L-FUZZY LANGUAGES
نویسندگان
چکیده
منابع مشابه
Operations Preserving Recognizable Languages
Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], where L is a language, the set of all words of L filtered by S. The filtering problem is to characterize the filters S such that, for every recognizable language L, L[S] is recognizable. In this paper, the filtering problem is solve...
متن کاملOn recognizable trace languages
Traces are a model for concurrency, whose formal definition is due to Mazurkiewicz [9]. In short, an alphabet A is fixed, with an independence relation on A. Traces can be defined as equivalence classes of words on A, under the relation that allows commutation of consecutive independent letters; and they are uniquely represented by certain A-labeled posets. A trace language is a set of traces o...
متن کاملOn Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the monoid of timed words into a bounded subset of itself. We show that the recognizable languages are exactly those accepted by deterministic timed automata and argue that this is, perhaps, the right class of timed languag...
متن کاملRecognizable Subsets of the Two Letter Plactic Monoid
The plactic monoid P la(a, b) on two letters will be studied from the point of view of classical language theory. In particular, we will give the fine structure of its recognizable subsets.
متن کاملZeta Functions of Recognizable Languages
LITP 4 place Jussieu 75005 Paris Abs t rac t Motivated by symbolic dynamics and algebraic geometry over finite fields, we define cyclic languages and the zeta function of a language. The main result is that the zeta function of a cyclic language which is recognizable by a finite automaton is rational. I. In t roduct ion Motivated by algebraic geometry over finite fields and symbolic dynamics, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING & TECHNOLOGY
سال: 2019
ISSN: 0976-6499,0976-6480
DOI: 10.34218/ijaret.10.3.2019.011